Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
نویسنده
چکیده
منابع مشابه
D.D.KOUVATSOS et al: PERFORMANCE MODELLING OF WORMHOLE-ROUTED PERFORMANCE MODELLING OF WORMHOLE-ROUTED HYPERCUBES WITH BURSTY TRAFFIC AND FINITE BUFFERS
An open queueing network model (QNM) is proposed for wormhole-routed hypercubes with finite buffers and deterministic routing subject to a compound Poisson arrival process (CPP) with geometrically distributed batches or, equivalently, a generalised exponential (GE) interarrival time distribution. The GE/G/1/K queue and appropriate GE-type flow formulae are adopted, as cost-effective building bl...
متن کاملThe Power of Lookahead in Small-World Routing Networks
Topologies and routing protocols for peer-to-peer networks have witnessed a flurry of research activity recently. Almost all designs employ greedy routing in one form or the other. Randomized topologies that are currently under investigation fall into two categories: (a) small-world network topologies based upon Kleinberg’s construction [Kle00], and (b) randomized variants of deterministic topo...
متن کاملComparative Performance Analysis of k-Ary n-Cube Topologies with Multiple Virtual Channels and Finite Size Buffers
Comparative Performance Analysis of k-Ary n-Cube Topologies with Multiple Virtual Channels and Finite Size Buffers N. Alzeidi, M. Ould-Khaoua, L. M. Mackenzie Computing Science Department, University of Glasgow, UK {zeidi, mohamed, lewis}@dcs.gla.ac.uk Abstract Comparative performance studies of k-ary n-cubes under different design constraints and operating conditions have been widely reported ...
متن کاملEfficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
Abst rac t : We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for cert~n multiprocessor interconnection networks and give their analysis in terms of the compactness and the size (the maximum number of buffers per node (per link)). The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate an...
متن کاملKnow thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗†
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world networks. In each of these networks, a node has out-degree O(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. Our contribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 39 شماره
صفحات -
تاریخ انتشار 1990